Minimum Dynamic Power CMOS Circuit Design by a Reduced Constraint Set Linear Program

نویسندگان

  • Tezaswi Raja
  • Vishwani D. Agrawal
  • Michael L. Bushnell
چکیده

In the previous work the problem of nding gate delays to eliminate glitches has been solved by lin ear programs LP requiring an exponentially large number of constraints By introducing two additional variables per gate namely the fastest and the slow est arrival times besides the gate delay we reduce the number of the LP constraints to be linear in circuit size For example the gate c circuit requires constraints as compared to the million con straints needed with the previous method The re duced constraints provably produce the same exact LP solution as obtained by the exponential set of con straints For the rst time we are able to optimize all ISCAS benchmarks For the c circuit when the input to output delay is constrained not to in crease a design with delay bu ers consumes only peak and average power as compared to an unoptimized design As shown in previous work the use of delay bu ers is essential in this case The practicality of the design is demonstrated by imple menting an optimized bit ALU circuit for which the power consumption was obtained by a circuit level simulator

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generalized Minimum Dynamic Power and High-Speed Design Method for CMOS Circuits

We formulate a linear program (LP) to simultaneously minimize the dynamic power and overall delay of a CMOS circuit. To eliminate all glitches either without or with minimal number of delay bu ers, a CMOS gate is assumed to have adjustable input to output delays for each input. Since these delays are not independent, a transistor sizing problem would require very complex non-linear optimization...

متن کامل

Leakage and Dynamic Glitch Power Minimization Using Integer Linear Programming for Vth Assignment and Path Balancing

This paper presents a novel technique, which uses integer linear programming (ILP) to minimize the leakage power in a dual-threshold static CMOS circuit by optimally placing high-threshold devices and simultaneously reduces the glitch power using the smallest number of delay elements to balance path delays. The constraint set size for the ILP model is linear in the circuit size. Experimental re...

متن کامل

CMOS Leakage and Glitch Minimization for Power-Performance Tradeoff

A mixed integer linear programming (MILP) technique simultaneously minimizes the leakage and glitch power consumption of a static CMOS circuit for any specified input to output delay. Using dual-threshold devices the number of high-threshold devices is maximized and a minimum number of delay elements are inserted to reduce the differential path delays below the inertial delays of incident gates...

متن کامل

Design of power-efficient adiabatic charging circuit in 0.18μm CMOS technology

In energy supply applications for low-power sensors, there are cases where energy should be transmitted from a low-power battery to an output stage load capacitor. This paper presents an adiabatic charging circuit with a parallel switches approach that connects to a low-power battery and charges the load capacitor using a buck converter which operates in continuous conduction mode (CCM). A gate...

متن کامل

Low-Power Adder Design for Nano-Scale CMOS

A fast low-power 1-bit full adder circuit suitable for nano-scale CMOS implementation is presented. Out of the three modules in a common full-adder circuit, we have replaced one with a new design, and optimized another one, all with the goal to reduce the static power consumption. The design has been simulated and evaluated using the 65 nm PTM models.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003